MIME-Version: 1.0
Server: CERN/3.0
Date: Sunday, 24-Nov-96 22:44:33 GMT
Content-Type: text/html
Content-Length: 18992
Last-Modified: Sunday, 24-Nov-96 20:23:50 GMT

<HTML>

<HEAD>
<TITLE>CS472 Fall 96 Course Materials</TITLE>
</HEAD>

<BODY>

<H1>
CS472 Fall 1996<br>
Foundations of Artificial Intelligence<br>
Course Materials
</H1>

<HR>

<UL>
<LI><!WA0><!WA0><!WA0><!WA0><A HREF="news:cornell.class.cs472">CS472/473 Newsgroup</A>
<LI><!WA1><!WA1><!WA1><!WA1><A HREF="#1">CS472 Handouts</A>
<LI><!WA2><!WA2><!WA2><!WA2><A HREF="#2">CS472 Lecture Notes</A>
<LI><!WA3><!WA3><!WA3><!WA3><A HREF="#3">CS472 Homeworks and Solutions</A>
<LI><!WA4><!WA4><!WA4><!WA4><A HREF="#4">CS473 Handouts and Project Information</A>
<LI><!WA5><!WA5><!WA5><!WA5><A HREF="#5">CS473 Lisp Mini-Tutorial</A>
<LI><!WA6><!WA6><!WA6><!WA6><A HREF="#6">Lisp Environments
<LI><!WA7><!WA7><!WA7><!WA7><A HREF="#7">Useful Common Lisp and AI Links</a></H2></A>
</UL>

<p>Note: Many of these files are <i>Postscript</i> files (their names
end in ".ps").  No browser we know of can display them directly, so you
either a) have to specify a helper application (like ghostview) to
display them for you, or b) you can download the file and do something
with it locally (for example, in unix you could "lpr" it to a
laser-printer which understands Postscript).<br><br>

Netscape Navigator in the PC lab, at least on some machines, is
already configured to use ghostview.  If you try it, and it doesn't
work, try <!WA8><!WA8><!WA8><!WA8><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/pickGhostview.html">this</A>.</p>

<HR>
<H2><A NAME = "1">CS472 Handouts</a></H2>

<!WA9><!WA9><!WA9><!WA9><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/handouts/syllabus.ps">
<bf>Tentative Course Syllabus </bf> </a> <em> (last modified 11/4)</em><br>
<!WA10><!WA10><!WA10><!WA10><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/handouts/general-info.ps">
<bf>General Course Information </bf> </a> <em> (last modified 9/6)</em>
[<!WA11><!WA11><!WA11><!WA11><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/handouts/general-info/general-info.html">html</a>] <br>

<HR>

<H2><A NAME = "2">CS472 Lecture Notes</a></H2>

<p>
<H3><em>Introduction to AI</em></H3>

<DL>
<dt><bf>(Aug 30)</bf>  Defining Artificial Intelligence 
[  <!WA12><!WA12><!WA12><!WA12><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture01.ps"><em> postscript</em></a>; 
   <!WA13><!WA13><!WA13><!WA13><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture01-2perpg.ps"><em> postscript, 2 per page</em></a>;
   <!WA14><!WA14><!WA14><!WA14><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture01/lecture01.html"><em>html</em></a> ]<br>
</DL>


<DL>
<dt><bf>(Sep 02)</bf>  Uninformed Search
 [ <!WA15><!WA15><!WA15><!WA15><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture02.ps"><em> postscript</em></a>;
   <!WA16><!WA16><!WA16><!WA16><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture02-2perpg.ps"><em> postscript, 2 per page</em></a>;
   <!WA17><!WA17><!WA17><!WA17><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture02/lecture02.html"><em>html</em></a> ]<br>
</DL>


<DL>
<dt>(Sep 04)</bf>  Heuristic Search
[ <!WA18><!WA18><!WA18><!WA18><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture03.ps"><em> postscript</em></a>;
  <!WA19><!WA19><!WA19><!WA19><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture03-2perpg.ps"><em> postscript, 2 per page</em></a>;
  <!WA20><!WA20><!WA20><!WA20><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture03/lecture03.html"><em>html</em></a> ]<br>
</DL>

<DL>
<dt>(Sep 06)</bf>  Optimal Search
[ <!WA21><!WA21><!WA21><!WA21><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture04.ps"><em> postscript</em></a>;
  <!WA22><!WA22><!WA22><!WA22><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture04-2perpg.ps"><em> postscript, 2 per page</em></a>;
  <!WA23><!WA23><!WA23><!WA23><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture04/lecture04.html"><em>html</em></a> ]<br>
</DL>

<DL>
<DT><bf>(Sep 09)</bf>  Admissible Heuristics, Adversarial Search
[ <!WA24><!WA24><!WA24><!WA24><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture05.ps"><em> postscript</em></a>;
  <!WA25><!WA25><!WA25><!WA25><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture05-2perpg.ps"><em> postscript, 2 per page</em></a>; 
  <!WA26><!WA26><!WA26><!WA26><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture05/lecture05.html"><em>html</em></a> ]<br>
</DL>

<DL>
<DT><bf>(Sep 11)</bf>  Minimax, Motivation for Alph-beta Pruning
 [ <!WA27><!WA27><!WA27><!WA27><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture06.ps"><em> postscript</em></a>;
   <!WA28><!WA28><!WA28><!WA28><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture06-2perpg.ps"><em> postscript, 2 per page</em></a>;
   <!WA29><!WA29><!WA29><!WA29><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture06/lecture06.html"><em>html</em></a> ] <br>
</DL>

<DL>
<DT><bf>(Sep 13)</bf>  Alph-beta Pruning, State-of-the-Art in Game Playing
[  <!WA30><!WA30><!WA30><!WA30><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture07.ps"><em> postscript</em></a>;
   <!WA31><!WA31><!WA31><!WA31><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture07-2perpg.ps"><em> postscript, 2 per page</em></a>;
   <!WA32><!WA32><!WA32><!WA32><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture07/lecture07.html"><em>html</em></a> ] <br>
</DL>

<DL>
<DT><bf>(Sep 16)</bf>  Introduction to Machine Learning, K-nn
  [ <!WA33><!WA33><!WA33><!WA33><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture08.ps"><em> postscript</em></a>;
    <!WA34><!WA34><!WA34><!WA34><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture08-2perpg.ps"><em> postscript, 2 per page</em></a>;
    <!WA35><!WA35><!WA35><!WA35><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture08/lecture08.html"><em>html</em></a> ] <br>
</DL>


<DL>
<DT><bf>(Sep 18)</bf>  Decision Tree Learning
  [ <!WA36><!WA36><!WA36><!WA36><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture09.ps"><em> postscript</em></a>;
    <!WA37><!WA37><!WA37><!WA37><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture09-2perpg.ps"><em> postscript, 2 per page</em></a>;
    <!WA38><!WA38><!WA38><!WA38><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture09/lecture09.html"><em>html</em></a> ]<br>
</DL>

<DL>
<DT><bf>(Sep 20)</bf>  Issues in Decision Tree Learning
  [ <!WA39><!WA39><!WA39><!WA39><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture10.ps"><em> postscript</em></a>;
    <!WA40><!WA40><!WA40><!WA40><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture10-2perpg.ps"><em> postscript, 2 per page</em></a>;
    <!WA41><!WA41><!WA41><!WA41><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture10/lecture10.html"><em>html</em></a> ]<br>
</DL>

<DL>
<DT><bf>(Sep 23)</bf>  Learning as Search
  [ <!WA42><!WA42><!WA42><!WA42><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture11.ps"><em> postscript</em></a>;
    <!WA43><!WA43><!WA43><!WA43><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture11-2perpg.ps"><em> postscript, 2 per page</em></a>; 
    <!WA44><!WA44><!WA44><!WA44><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture11/lecture11.html"><em>html</em></a>    ]<br>
</DL>

<DL>
<DT><bf>(Sep 25)</bf>  The Version Space Algorithm
  [ <!WA45><!WA45><!WA45><!WA45><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture12.ps"><em> postscript</em></a>;
    <!WA46><!WA46><!WA46><!WA46><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture12-2perpg.ps"><em> postscript, 2 per page</em></a>; 
    <!WA47><!WA47><!WA47><!WA47><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture12/lecture12.html"><em>html</em></a>    ]<br>
</DL>

<DL>
<DT><bf>(Sep 27)</bf>  Genetic Algorithms
  [ <!WA48><!WA48><!WA48><!WA48><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture13.ps"><em> postscript</em></a>;
    <!WA49><!WA49><!WA49><!WA49><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture13-2perpg.ps"><em> postscript, 2 per page</em></a>; 
    <!WA50><!WA50><!WA50><!WA50><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture13/lecture13.html"><em>html</em></a>    ]<br>
</DL>

<DL>
<DT><bf>(Sep 30)</bf>  Neural Networks: Feedforward Networks
  [ <!WA51><!WA51><!WA51><!WA51><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture14.ps"><em> postscript</em></a>;
    <!WA52><!WA52><!WA52><!WA52><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture14-2perpg.ps"><em> postscript, 2 per page</em></a>; 
    <!WA53><!WA53><!WA53><!WA53><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture14/lecture14.html"><em>html</em></a>    ]<br>
</DL>

<DL>
<DT><bf>(Oct 2)</bf>  Neural Networks: Backpropagation
  [ <!WA54><!WA54><!WA54><!WA54><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture15.ps"><em> postscript</em></a>;
    <!WA55><!WA55><!WA55><!WA55><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture15-2perpg.ps"><em> postscript, 2 per page</em></a>; 
    <!WA56><!WA56><!WA56><!WA56><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture15/lecture15.html"><em>html</em></a>    ]<br>
</DL>

<DL>
<DT><bf>(Oct 4)</bf>  ML Applications
  [ <!WA57><!WA57><!WA57><!WA57><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture16.ps"><em> postscript</em></a>;
    <!WA58><!WA58><!WA58><!WA58><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture16-2perpg.ps"><em> postscript, 2 per page</em></a>; 
    <!WA59><!WA59><!WA59><!WA59><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture16/lecture16.html"><em>html</em></a>    ]<br>
</DL>

<DL>
<DT><bf>(Oct 7)</bf>  History of AI; Rule-Based Systems
  [ <!WA60><!WA60><!WA60><!WA60><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture17.ps"><em> postscript</em></a>;
    <!WA61><!WA61><!WA61><!WA61><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture17-2perpg.ps"><em> postscript, 2 per page</em></a>; 
    <!WA62><!WA62><!WA62><!WA62><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture17/lecture17.html"><em>html</em></a>    ]<br>
</DL>

<DL>
<DT><bf>(Oct 9)</bf>  Forward Chaining Rule-Based Systems
  [ <!WA63><!WA63><!WA63><!WA63><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture18.ps"><em> postscript</em></a>;
    <!WA64><!WA64><!WA64><!WA64><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture18-2perpg.ps"><em> postscript, 2 per page</em></a>; 
    <!WA65><!WA65><!WA65><!WA65><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture18/lecture18.html"><em>html</em></a>    ]<br>
</DL>


<DL>
<DT><bf>(Oct 16)</bf>  Backward Chaining Rule-Based Systems
  [ <!WA66><!WA66><!WA66><!WA66><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture19.ps"><em> postscript</em></a>;
    <!WA67><!WA67><!WA67><!WA67><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture19-2perpg.ps"><em> postscript, 2 per page</em></a>; 
    <!WA68><!WA68><!WA68><!WA68><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture19/lecture19.html"><em>html</em></a>    ]<br>
</DL>

<DL>
<DT><bf>(Oct 23)</bf> Knowledge Representation: Semantic Nets
  [ <!WA69><!WA69><!WA69><!WA69><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture20.ps"><em> postscript</em></a>;
    <!WA70><!WA70><!WA70><!WA70><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture20-2perpg.ps"><em> postscript, 2 per page</em></a>; 
    <!WA71><!WA71><!WA71><!WA71><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture20/lecture20.html"><em>html</em></a>    ]<br>
</DL>

<DL>
<DT><bf>(Oct 25)</bf> Representing Facts in First-Order Logic
  [ <!WA72><!WA72><!WA72><!WA72><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture21.ps"><em> postscript</em></a>;
    <!WA73><!WA73><!WA73><!WA73><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture21-2perpg.ps"><em> postscript, 2 per page</em></a>; 
    <!WA74><!WA74><!WA74><!WA74><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture21/lecture21.html"><em>html</em></a>    ]<br>
</DL>

<DL>
<DT><bf>(Oct 28)</bf> Resolution Theorem Proving; Conversion to Clause Form
  [ <!WA75><!WA75><!WA75><!WA75><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture22.ps"><em> postscript</em></a>;
    <!WA76><!WA76><!WA76><!WA76><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture22-2perpg.ps"><em> postscript, 2 per page</em></a>; 
    <!WA77><!WA77><!WA77><!WA77><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture22/lecture22.html"><em>html</em></a>    ]<br>
</DL>

<DL>
<DT><bf>(Oct 30)</bf> Unification; Selection of Clauses
  [ <!WA78><!WA78><!WA78><!WA78><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture23.ps"><em> postscript</em></a>;
    <!WA79><!WA79><!WA79><!WA79><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture23-2perpg.ps"><em> postscript, 2 per page</em></a>; 
    <!WA80><!WA80><!WA80><!WA80><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture23/lecture23.html"><em>html</em></a>    ]<br>
</DL>

<DL>
<DT><bf>(Nov 1)</bf> Intro to Planning; The Frame Problem
  [ <!WA81><!WA81><!WA81><!WA81><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture24.ps"><em> postscript</em></a>;
    <!WA82><!WA82><!WA82><!WA82><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture24-2perpg.ps"><em> postscript, 2 per page</em></a>; 
    <!WA83><!WA83><!WA83><!WA83><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture24/lecture24.html"><em>html</em></a>    ]<br>
</DL>

<DL>
<DT><bf>(Nov 4)</bf> Partial Order Planning (I)
  [ <!WA84><!WA84><!WA84><!WA84><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture25.ps"><em> postscript</em></a>;
    <!WA85><!WA85><!WA85><!WA85><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture25-2perpg.ps"><em> postscript, 2 per page</em></a>; 
    <!WA86><!WA86><!WA86><!WA86><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture25/lecture25.html"><em>html</em></a>    ]<br>
</DL>

<DL>
<DT><bf>(Nov 6)</bf> Partial Order Planning (II)
  [ <!WA87><!WA87><!WA87><!WA87><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture26.ps"><em> postscript</em></a>;
    <!WA88><!WA88><!WA88><!WA88><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture26-2perpg.ps"><em> postscript, 2 per page</em></a>; 
    <!WA89><!WA89><!WA89><!WA89><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture26/lecture26.html"><em>html</em></a>    ]<br>
</DL>

<DL>
<DT><bf>(Nov 11)</bf> Hierarchical Planning, Reasoning Under
Uncertainty (intro)
  [ <!WA90><!WA90><!WA90><!WA90><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture27.ps"><em> postscript</em></a>;
    <!WA91><!WA91><!WA91><!WA91><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture27-2perpg.ps"><em> postscript, 2 per page</em></a>; 
    <!WA92><!WA92><!WA92><!WA92><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture27/lecture27.html"><em>html</em></a>    ]<br>
</DL>

<DL>
<DT><bf>(Nov 13)</bf> Probabilistic Reasoning, Bayesian Inference 
  [ <!WA93><!WA93><!WA93><!WA93><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture28.ps"><em> postscript</em></a>;
    <!WA94><!WA94><!WA94><!WA94><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture28-2perpg.ps"><em> postscript, 2 per page</em></a>; 
    <!WA95><!WA95><!WA95><!WA95><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture28/lecture28.html"><em>html</em></a>    ]<br>
</DL>

<DL>
<DT><bf>(Nov 15)</bf> Belief Networks
  [ <!WA96><!WA96><!WA96><!WA96><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture29.ps"><em> postscript</em></a>;
    <!WA97><!WA97><!WA97><!WA97><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture29-2perpg.ps"><em> postscript, 2 per page</em></a>; 
    <!WA98><!WA98><!WA98><!WA98><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture29/lecture29.html"><em>html</em></a>    ]<br>
</DL>

<DL>
<DT><bf>(Nov 18)</bf> Natural Language Processing (intro)
  [ <!WA99><!WA99><!WA99><!WA99><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture30.ps"><em> postscript</em></a>;
    <!WA100><!WA100><!WA100><!WA100><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture30-2perpg.ps"><em> postscript, 2 per page</em></a>; 
    <!WA101><!WA101><!WA101><!WA101><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture30/lecture30.html"><em>html</em></a>    ]<br>
</DL>

<DL>
<DT><bf>(Nov 20)</bf> Syntactic Analysis: top-down parsing
  [ <!WA102><!WA102><!WA102><!WA102><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture31.ps"><em> postscript</em></a>;
    <!WA103><!WA103><!WA103><!WA103><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture31-2perpg.ps"><em> postscript, 2 per page</em></a>; 
    <!WA104><!WA104><!WA104><!WA104><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture31/lecture31.html"><em>html</em></a>    ]<br>
</DL>

<DL>
<DT><bf>(Nov 22)</bf> Sentence Analysis: bottom-up chart parsing
  [ <!WA105><!WA105><!WA105><!WA105><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture32.ps"><em> postscript</em></a>;
    <!WA106><!WA106><!WA106><!WA106><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture32-2perpg.ps"><em> postscript, 2 per page</em></a>; 
    <!WA107><!WA107><!WA107><!WA107><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture32/lecture32.html"><em>html</em></a>    ]<br>
</DL>

<DL>
<DT><bf>(Nov 25)</bf> Conceptual Sentence Analysis: the CIRCUS parser;
The Problem of Inference
  [ <!WA108><!WA108><!WA108><!WA108><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture33.ps"><em> postscript</em></a>;
    <!WA109><!WA109><!WA109><!WA109><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture33-2perpg.ps"><em> postscript, 2 per page</em></a>; 
    <!WA110><!WA110><!WA110><!WA110><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/lectures/lecture33/lecture33.html"><em>html</em></a>    ]<br>
</DL>

<DL>
<DT><bf>(Nov 27)</bf> Machine Learning of Natural Language (no on-line notes)
</DL>

<HR>
<H2><A NAME = "3">CS472 Homeworks and Solutions</a></H2>

<!WA111><!WA111><!WA111><!WA111><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/hwk/hwk1.ps">
Homework 1</a> (due Monday, 9/16)[<!WA112><!WA112><!WA112><!WA112><a href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/hwk/hwk1/hwk1.html">html</a>] <br>
<!WA113><!WA113><!WA113><!WA113><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/hwk/hwk1-sol.ps">
Homework 1 Solutions</a> [<!WA114><!WA114><!WA114><!WA114><a href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/hwk/hwk1-sol/hwk1-sol.html">html</a>] <br>
<!WA115><!WA115><!WA115><!WA115><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/hwk/hwk2.ps">
Homework 2</a> (due Monday, 9/30)[<!WA116><!WA116><!WA116><!WA116><a href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/hwk/hwk2/hwk2.html">html</a>] <br>
<!WA117><!WA117><!WA117><!WA117><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/hwk/hwk2-sol.ps">
Homework 2 Solutions</a> [<!WA118><!WA118><!WA118><!WA118><a href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/hwk/h2-sol/h2-sol.html">html</a>] <br>
<!WA119><!WA119><!WA119><!WA119><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/hwk/ttt-count.lisp">
Lisp code </a> for counting tic-tac-toe games (Homework 2) <br>
<!WA120><!WA120><!WA120><!WA120><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/hwk/hwk3.ps">
Homework 3</a> (due Wednesday, 10/16) <br>
<!WA121><!WA121><!WA121><!WA121><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/hwk/hwk3-sol.ps">
Homework 3 Solutions</a> <br>
<!WA122><!WA122><!WA122><!WA122><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/hwk/midterm-95.ps">
Midterm/Prelim from Fall 1995</a> (We covered all of the material on that midterm.)[<!WA123><!WA123><!WA123><!WA123><a href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/hwk/midterm-95/midterm-95.html">html</a>] <br> 
<!WA124><!WA124><!WA124><!WA124><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/hwk/midterm_sol-95.ps">
Solution to 1995 Midterm</a> [<!WA125><!WA125><!WA125><!WA125><a href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/hwk/midterm_sol-95/midterm_sol-95.html">html</a>] <br>
<!WA126><!WA126><!WA126><!WA126><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/hwk/midterm_sol.ps">
Solution to 1996 Midterm</a> [<!WA127><!WA127><!WA127><!WA127><a href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/hwk/midterm_sol/midterm_sol.html">html</a>] <br>
<!WA128><!WA128><!WA128><!WA128><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/hwk/hwk4.ps">
Homework 4</a> ***Note that a clarification for problem 4 was added at 5:30p.m. on
11/6. Here is the clarification: Unless otherwise specified, you can assume that either
(1) the system adds the fact that 
JB is a 1973 Dodge Van to the KB at query time, or (2) the fact that JB is a 1973 Dodge
Van already exists in the KB. The postscript document has been modified only to include 
this clarification. *** (due Monday, 11/11) <br>
<!WA129><!WA129><!WA129><!WA129><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/hwk/hwk4-sol.ps">
Homework 4 Solutions</a> <br>
<DL>
Note that program information is also available in the CS472 folder on the j drive
of the PCs. <br>
<!WA130><!WA130><!WA130><!WA130><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/hwk/prog1/prog1.ps">
Program 1</a> (due Monday, 9/23)[<!WA131><!WA131><!WA131><!WA131><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/hwk/prog1/prog1.html">html</a>] <br>
<DD><!WA132><!WA132><!WA132><!WA132><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/hwk/prog1/rubix.lisp">
rubix.lisp </a> <br>
<DD><!WA133><!WA133><!WA133><!WA133><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/hwk/prog1/rubix-search.lisp">
rubix-search.lisp </a> <br>
</DD>
<!WA134><!WA134><!WA134><!WA134><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/hwk/sol1/sol1.ps">
Program 1 Solution</a> [<!WA135><!WA135><!WA135><!WA135><a href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/hwk/sol1/sol1.html">html</a>] <br>
<DD><!WA136><!WA136><!WA136><!WA136><a href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/hwk/sol1/rubix-solution.lisp">
<em>rubix-solution.lisp</em></a> <br>
</DL>
<DL>

<!WA137><!WA137><!WA137><!WA137><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/hwk/prog2/prog2.ps">
Program 2</a> (due Wednesday, 10/23)[<!WA138><!WA138><!WA138><!WA138><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/hwk/prog2/prog2.html">html</a>] <br>
<DD><!WA139><!WA139><!WA139><!WA139><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/hwk/prog2/general-game.lisp">
general-game.lisp </a> <br>
<DD><!WA140><!WA140><!WA140><!WA140><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/hwk/prog2/othello.lisp">
othello.lisp </a> <br>
<DD><!WA141><!WA141><!WA141><!WA141><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/hwk/sol2/sol2.ps">
Program 2 Solution</a> [<!WA142><!WA142><!WA142><!WA142><a href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/hwk/sol2/sol2.html">html</a>] <br>
<DD><!WA143><!WA143><!WA143><!WA143><a href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/hwk/sol2/minimax-solution.lisp">
<em>minimax-solution.lisp</em></a> <br>
</DL>
<DL>

<!WA144><!WA144><!WA144><!WA144><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/hwk/prog3/prog3.ps">
Program 3</a> (due Friday, 11/22 *****New due date: Monday 11/25 at
the beginning of class*****)[<!WA145><!WA145><!WA145><!WA145><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/hwk/prog3/prog3.html">html</a>] <br>
<DD><!WA146><!WA146><!WA146><!WA146><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/hwk/prog3/planner.lisp">
planner.lisp </a> <br>
<DD><!WA147><!WA147><!WA147><!WA147><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/hwk/prog3/rubix-planner.lisp">
rubix-planner.lisp </a> <br>
</DL>
<HR>
<H2><A NAME = "4">CS473 Handouts and Project Information</a></H2>

<!WA148><!WA148><!WA148><!WA148><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/handouts/projects-9-22.ps">
<bf> Course Syllabus and Project Information</bf> </a> <em> (last modified 9/22)</em><br>
<!WA149><!WA149><!WA149><!WA149><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/handouts/project-ideas.html">
<bf> Project Ideas </bf> </a> <br>
<bf> Format for project proposal </bf> <em> (due at class time on Tues 10/1, PC lab) </em>
   <!WA150><!WA150><!WA150><!WA150><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/handouts/project-proposals1.ps"> <em> postscript </em> </a>,
   <!WA151><!WA151><!WA151><!WA151><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/handouts/project-proposals/project-proposals.html"> <em> html </em> </a> <br>
<!WA152><!WA152><!WA152><!WA152><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/handouts/473-due-dates.html">
<bf> CS473 Due Dates </bf> </a> <br>
<bf> Format for status reports </bf> 
   <!WA153><!WA153><!WA153><!WA153><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/handouts/status-reports.ps"> <em> postscript </em> </a>,
   <!WA154><!WA154><!WA154><!WA154><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/handouts/status-reports/status-reports.html"> <em> html </em> </a> <br>

<br><br>
Here are some examples of code with <em> good procedural and data abstraction</em> as well 
as good, consistent indentation. <br>
Courtesy of Ed Wayt and Oumi Mehrotra. <br>
   <ul> <li> <!WA155><!WA155><!WA155><!WA155><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/handouts/wayt-gene.lisp">gene.lisp </a><br> 
        <li> <!WA156><!WA156><!WA156><!WA156><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/handouts/wayt-genetic.lisp">genetic.lisp </a><br> 
   </ul>

<bf>Generic Plan for Finishing the Project On Time:</bf> It will be
easier if you write your code in stages. The code reviews provide
intermediate feedback on your progress.  Here is how I'd suggest
working on the code. (If, for some reason, you think that your
particular project doesn't fit well into the structure below, let me
know and I can help you create a schedule that does...) <br>

   <ul> <li> First, think about the major ``modules'' that your project requires and the
knowledge structures (e.g., rules, state descriptions, board representations) that you'll
need (including any related constructor functions and accessor functions --- as described by
Winston in our main text). Implement the modules   as ``stubs,'' i.e., lisp functions that
have no substantive code, but that specify all of the necessary parameters and that make calls
to the appropriate module stubs.  Write the code to implement your (generic) knowledge
structures. <br><em> (completed for code review 1, 29 Oct) </em> <br>

    <li> Get the system running from beginning to end as soon as possible --- just on a
simple example. This will invariably require making many simplifying
assumptions. Design the inference engine or control strategies needed for your
system. E.g., specific search strategy, rule interpreter, move generator,
learning algorithm. <br> <em> (completed for code review 2, 18 Nov)</em> <br>
 
    <li> Finish the implementation of the AI part (inference engine,
control strategies, learning algorithm) of your system.  Incrementally
remove the simplifying assumptions by adding the necessary
code. Evaluate the system appropriately. Be sure to leave enough time
for the evaluation --- it is an IMPORTANT component of the final
grade.<br> <em> (by project end) </em> <br>
    </ul>

<HR>
<H2><A NAME = "5">CS473 Lisp Mini-Tutorial</a></H2>
<!WA157><!WA157><!WA157><!WA157><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/labs/lab01/lab01.html">
<bf> Mini-tutorial 1</bf></a>  (introduction to lisp) <br>
<!WA158><!WA158><!WA158><!WA158><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/labs/lab02/lab02.html">
<bf> Mini-tutorial 2 </bf></a> (list primitives, defining functions) <br>
<!WA159><!WA159><!WA159><!WA159><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/labs/lab03/lab03.html">
<bf> Mini-tutorial 3 </bf></a> (conditionals, recursion) <br>
<!WA160><!WA160><!WA160><!WA160><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/labs/lab04/lab04.html">
<bf> Mini-tutorial 4 </bf></a> (data abstraction, mapping, iteration) <br>
<!WA161><!WA161><!WA161><!WA161><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/labs/lab05/lab05.html">
<bf> Mini-tutorial 5 </bf></a> (debugging, structures, objects) <br>
<HR>
<H2><A NAME = "6">Lisp Environments</a></H2>
<!WA162><!WA162><!WA162><!WA162><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/handouts/allegro/allegro.html">
<bf> The Allegro Lisp Editor </bf></a> (the lisp for the PC lab)<br>
<!WA163><!WA163><!WA163><!WA163><A href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/handouts/lucid.html">
<bf> Using Lucid Lisp with Emacs</bf></a> (only useful if you have an account on 
	the CS machines and want to use Common Lisp on those machines rather than the 
	PC lab) <br> 
<HR>
<H2><A NAME = "7">Useful Common Lisp and AI Links</a></H2>

<!WA164><!WA164><!WA164><!WA164><A href="http://www.math.uio.no:80/cltl/clm/clm.html">
<bf> Common Lisp The Language, Guy Steele</bf> </a><br>
<!WA165><!WA165><!WA165><!WA165><A href="http://www.cs.tulane.edu/www/Villamil/lisp/lisp1.html">
<bf> Tulane Common Lisp Tutorial</bf> </a><br>
<!WA166><!WA166><!WA166><!WA166><A href="http://www.apl.jhu.edu/~hall/lisp.html">
<bf> Johns Hopkins Common Lisp Tutorial</bf> </a><br>
<!WA167><!WA167><!WA167><!WA167><A href="http://www.cs.cmu.edu:80/afs/cs.cmu.edu/project/ai-repository/ai/lang/lisp/0.html">
<bf> Common Lisp Resouces from CMU AI Repository</bf> </a> (including the Lisp FAQ) <br>
<!WA168><!WA168><!WA168><!WA168><A href="http://www.cs.cmu.edu/afs/cs.cmu.edu/project/ai-repository/ai/html/faqs/lang/lisp/part4/faq-doc-1.html">
<bf> Free Common Lisp implementations</bf></a> (from the CMU-AI Lisp FAQ)<br>
<!WA169><!WA169><!WA169><!WA169><A href="http://www.ics.uci.edu/pub/machine-learning-databases/">
<bf> Machine Learning Databases at UC Irvine</bf></a> (It's probably best to first
 check the end of the page for the README file associated with the data bases.) <br> 

<br><br>
<HR>
<!WA170><!WA170><!WA170><!WA170><A
href="http://www.cs.cornell.edu/Info/Courses/Current/CS472/cs472.html">Return
to CS472 home page</a>
